全文获取类型
收费全文 | 13018篇 |
免费 | 1412篇 |
国内免费 | 1112篇 |
专业分类
化学 | 1971篇 |
晶体学 | 22篇 |
力学 | 886篇 |
综合类 | 291篇 |
数学 | 8488篇 |
物理学 | 3884篇 |
出版年
2024年 | 10篇 |
2023年 | 112篇 |
2022年 | 141篇 |
2021年 | 259篇 |
2020年 | 306篇 |
2019年 | 334篇 |
2018年 | 311篇 |
2017年 | 356篇 |
2016年 | 376篇 |
2015年 | 305篇 |
2014年 | 545篇 |
2013年 | 914篇 |
2012年 | 591篇 |
2011年 | 675篇 |
2010年 | 622篇 |
2009年 | 778篇 |
2008年 | 832篇 |
2007年 | 838篇 |
2006年 | 815篇 |
2005年 | 647篇 |
2004年 | 599篇 |
2003年 | 647篇 |
2002年 | 586篇 |
2001年 | 506篇 |
2000年 | 516篇 |
1999年 | 421篇 |
1998年 | 411篇 |
1997年 | 325篇 |
1996年 | 238篇 |
1995年 | 169篇 |
1994年 | 176篇 |
1993年 | 135篇 |
1992年 | 133篇 |
1991年 | 126篇 |
1990年 | 90篇 |
1989年 | 84篇 |
1988年 | 79篇 |
1987年 | 56篇 |
1986年 | 45篇 |
1985年 | 74篇 |
1984年 | 84篇 |
1983年 | 39篇 |
1982年 | 43篇 |
1981年 | 48篇 |
1980年 | 34篇 |
1979年 | 22篇 |
1978年 | 22篇 |
1977年 | 14篇 |
1976年 | 15篇 |
1973年 | 9篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
71.
We introduce a random perturbed version of the classical fidelity and we show that it converges with the same rate of decay
of correlations, but not uniformly in the noise. This makes the classical fidelity unstable in the zero-noise limit. 相似文献
72.
We derive a moderate deviation principle for the lower tail probabilities of the length of a longest increasing subsequence in a random permutation. It refers to the regime between the lower tail large deviation regime and the central limit regime. The present article together with the upper tail moderate deviation principle in Ref. 12 yields a complete picture for the whole moderate deviation regime. Other than in Ref. 12, we can directly apply estimates by Baik, Deift, and Johansson, who obtained a (non-standard) Central Limit Theorem for the same quantity. 相似文献
73.
Robert J. Rubin 《Journal of statistical physics》1991,65(5-6):1207-1216
A one-dimensional lattice random walk in the presence ofm equally spaced traps is considered. The step length distribution is a symmetric exponential. An explicit analytic expression is obtained for the probability that the random walk will be trapped at thejth trapping site. 相似文献
74.
Alex Hellsten 《Archive for Mathematical Logic》2006,45(6):705-714
We extract some properties of Mahlo’s operation and show that some other very natural operations share these properties. The weakly compact sets form a similar hierarchy as the stationary sets. The height of this hierarchy is a large cardinal property connected to saturation properties of the weakly compact ideal. 相似文献
75.
Dmitry I. Belov Ronald D. Armstrong 《Computational Optimization and Applications》2006,33(2-3):319-332
This paper introduces a novel approach for extracting the maximum number of non-overlapping test forms from a large collection
of overlapping test sections assembled from a given item bank. The approach involves solving maximum set packing problems
(MSPs). A branch-and-bound MSP algorithm is developed along with techniques adapted from constraint programming to estimate
lower and upper bounds on the optimal MSP solution. The algorithm is general and can be applied in other applications including
combinatorial auctions. The results of computer simulations and experiments with an operational item bank are presented.
An erratum to this article is available at . 相似文献
76.
Brian Lucena 《Discrete Applied Mathematics》2007,155(8):1055-1065
One consequence of the graph minor theorem is that for every k there exists a finite obstruction set Obs(TW?k). However, relatively little is known about these sets, and very few general obstructions are known. The ones that are known are the cliques, and graphs which are formed by removing a few edges from a clique. This paper gives several general constructions of minimal forbidden minors which are sparse in the sense that the ratio of the treewidth to the number of vertices n does not approach 1 as n approaches infinity. We accomplish this by a novel combination of using brambles to provide lower bounds and achievable sets to demonstrate upper bounds. Additionally, we determine the exact treewidth of other basic graph constructions which are not minimal forbidden minors. 相似文献
77.
Many recent algorithmic approaches involve the construction of a differential equation model for computational purposes, typically
by introducing an artificial time variable. The actual computational model involves a discretization of the now time-dependent differential system, usually
employing forward Euler. The resulting dynamics of such an algorithm is then a discrete dynamics, and it is expected to be
“close enough” to the dynamics of the continuous system (which is typically easier to analyze) provided that small – hence
many – time steps, or iterations, are taken. Indeed, recent papers in inverse problems and image processing routinely report
results requiring thousands of iterations to converge. This makes one wonder if and how the computational modeling process
can be improved to better reflect the actual properties sought.
In this article we elaborate on several problem instances that illustrate the above observations. Algorithms may often lend
themselves to a dual interpretation, in terms of a simply discretized differential equation with artificial time and in terms
of a simple optimization algorithm; such a dual interpretation can be advantageous. We show how a broader computational modeling
approach may possibly lead to algorithms with improved efficiency.
AMS subject classification (2000) 65L05, 65M32, 65N21, 65N22, 65D18 相似文献
78.
研究了平面上系数{Xn,n≥0}为(?)-混合序列在满足,(q>1)等条件下的随机级数的增长性及值分布,得到了比较好的结果. 相似文献
79.
We apply a Bayesian approach to the problem of prediction in an unbalanced growth curve model using noninformative priors. Due to the complexity of the model, no analytic forms of the predictive densities are available. We propose both approximations and a prediction-oriented Metropolis-Hastings sampling algorithm for two types of prediction, namely the prediction of future observations for a new subject and the prediction of future values for a partially observed subject. They are illustrated and compared through real data and simulation studies. Two of the approximations compare favorably with the approximation in Fearn (1975, Biometrika, 62, 89–100) and are very comparable to the more accurate Rao-Blackwellization from Metropolis-Hastings sampling algorithm. 相似文献
80.